搜索资源列表
BTree
- B-Tree of order 4 Each node has at most 4 pointers and 3 keys, and at least 2 pointers and 1 key. Insert: 5, 3, 21, 9, 1, 13, 2, 7, 10, 12, 4, 8 Delete: 2, 21, 10, 3, 4
222
- 创建二叉树和实现二叉树的三种遍历 根据提示输入字符型数据创建二叉树，输入值为所有字符型数据 输出为遍历后的每个结点的值的顺序 创建二叉树并能实现二叉树的先序、中序、后序遍历 -Create a binary tree and binary tree traversal three Create a binary input is all character data prompted, enter the character data The output value o
enhancedBST
- 增强二叉搜索树是二叉搜索树的一种推广，其中每个结点除了保存关键字外，还保存了 以该结点为根的子树的结点数目（包括该结点本身）。通常我们使用链式结构来存储二叉搜索树。在本实验中， 我们要求使用链式结构实现增强二叉搜索树，并实现其建立、复制、前/中/后序遍历、层高统计、结构从属判断等操作。-Enhanced binary search tree is a generalization of a binary search tree, where each node except to save th
treecoder
- Each node of the tree is a pair of vp8_tree_indices.
Huffman
- 给出节点及节点上的值，生成huffman树，并输出结果-Give the value of the node, generate the Huffman tree, and output the results.
rbbinode
- Implementation of class RBBINode, which represents a node in the tree generated when parsing the Rules Based Break Iterator rules.
ID3
- MATLAB下的决策树ID3算法，应用信息增益来划分节点-ID3 decision tree algorithm under MATLAB application information gain to divide the node
shu
- 增强二叉搜索树是二叉搜索树的一种推广，其中每个结点除了保存关键字外，还保存了以该结点为根的子树的结点数目（包括该结点本身）。实现其建立、复制、前/中/后序遍历、层高统计、结构从属判断等操作。-Enhanced binary search tree is a generalization of a binary search tree, where each node except to save the keyword, but also save the node number points
treeview-show1.0
- 易语言 树形框的演示工具，可以增加节点，使用时，勾选节点然后点击左侧最大的按钮，就可以显示勾选的内容。-Easy language tree box of the demonstration tool, you can increase the node, when using, check the node and then click on the left side of the biggest button, you can display the contents of the hoo
ANTLRTreeRuleReturnScope
- First node or root node of tree matched for this rule.
BinarySortTree
- 二叉搜索树类的c++实现，实现建立树，插入，删除，查找等操作。它或者是一棵空树，或者是具有下列性质的二叉树： 若它的左子树不空，则左子树上所有结点的值均小于它的根结点的值； 若它的右子树不空，则右子树上所有结点的值均大于它的根结点的值； 它的左、右子树也分别为二叉排序树。-Binary search tree c++ implementation, to achieve the establishment of tree, insert, delete, search and other ope
ANTLRTreeParser
- Match . in tree parser has special meaning. Skip node or entire tree if node has children. If children, scan until corresponding UP node. -Match . in tree parser has special meaning. Skip node or entire tree if node has children. If children, sca
SanYuanZu_20131029110238
- 假设自上而下按层次，自左至右输入每个结点的一个三元组(N, P, L/R)。其中N 为本结点的元素，P 为其父结点，L 指示N 为P 的左孩子，R 指示N 为P的右孩子。试写一个建立二元树的左右链表示算法，并实现先根、中根、后根以及层序遍历算法。-Suppose a hierarchical top-down, left to right to enter a triple each node (N, P, L/R). Wherein the element N-based node, P i
ANTLRCommonTreeNodeStream
- Tracks tree depth. Level=0 means we re at root node level.
ib_user_sa
- after inserting @node into the tree, update the tree to account for both the new entry and any damage done by rebalance Source Code for Linux v2.13.6.
dri_drawable
- after inserting @node into the tree, update the tree to account for both the new entry and any damage done by rebalance Source Code for Linux v2.13.6.
Huffman
- 1.基本上已经完成压缩及解压缩操作的代码实现。 解压缩时关键还是文件流的操作，读取内容时采用逐字节读取，把0－255的十进制整数转化为二进制数，利用这些二进制数从哈夫曼树的根结点出发，0走左子，1走右子，找到叶子结点，把该叶子结点的下标写入新文件，最后处理有效位数不满8位的字节-1 basically completed the compression and decompression code implementation. Decompression is the key stre
BinarySearchHeapConstruction
- Binary Search Heap Construction-Read the statement of problem G for the definitions concerning trees. In the following we define the basic terminology of heaps. A heap is a tree whose internal nodes have each assigned a priority (a number) such that
Heapsort
- 堆排序是指利用堆这种数据结构所设计的一种排序算法，它是选择排序的一种。可以利用数组的特点快速定位指定索引的元素。堆分为大根堆和小根堆，是完全二叉树。大根堆的要求是每个节点的值都不大于其父节点的值，即A[PARENT[i]] >= A[i]。在数组的非降序排序中，需要使用的就是大根堆，因为根据大根堆的要求可知，最大的值一定在堆顶。-Heapsort refers to a sorting algorithm data structure designed using the heap, it
AVLTree-X
- 给出结点的插入序列，构造AVL Tree。-Given node insertion sequence, structure AVL Tree.